Post-Placement Functional Decomposition for FPGAs
نویسندگان
چکیده
This work explores the effect of adding a simple functional decomposition step to the traditional field programmable gate array (FPGA) CAD flow. Once placement has completed, alternative decompositions of the logic on the critical path are examined for potential delay improvements. The placed circuit is then modified to use the best decompositions found. Any placement illegalities introduced by the new decompositions are resolved by an incremental placement step. Experiments conducted on Altera’s Stratix chips indicate that this functional decomposition technique can provide a performance improvement of 7.6% on average, and up to 26.3% on a set of industrial designs.
منابع مشابه
Timing Driven Functional Decomposition for FPGAs
This work explores the effect of adding a timing driven functional decomposition step to the traditional field programmable gate array (FPGA) CAD flow. Once placement has completed, alternative decompositions of the logic on the critical path are examined for potential delay improvements. The placed circuit is then modified to use the best decompositions found. Any placement illegalities introd...
متن کاملEffective and Efficient Circuit Synthesis for LUT FPGAs Based on Functional Decomposition and Information Relationship Measures
The narrowing opportunity window and the dramatically increasing development costs of deep sub-micron application specific integrated circuit (ASIC) designs have presented new challenges to the development process. The cost of ASICs development and fabrication is presently so high that more and more companies are seeking alternative implementation platforms. Today, programmable logic devices (P...
متن کاملExperiments on Flexibilities for Logic and Routing Optimization in FPGAs
This paper presents experimental evidence for the need to create tighter links between logical and physical domains. Our experimental results show how gains reported by logic level optimizations|aimed at reducing the eeect of interconnect|fail to deliver after the circuits are placed and routed. We use functional exibilities represented by SPFDs 8] to remove redundant wires and nodes in circuit...
متن کاملBoolean matching for LUT-based logic blocks with applications toarchitecture evaluation and technology mapping
In this paper, we present new Boolean matching methods for lookup table (LUT)-based programmable logic blocks (PLBs) and their applications to PLB architecture evaluations and field programmable gate array (FPGA) technology mapping. Our Boolean matching methods, which are based on functional decomposition operations, can characterize functions for complex PLBs consisting of multiple LUTs (possi...
متن کاملSpeeding up Online Placement for XILINX FPGAs by Reducing Configuration Overhead
Recent generations of FPGAs allow run-time partial reconfiguration. To increase the efficacy of reconfigurable computing, multitasking on FPGAs is proposed. One of the challenging problems in multitasking systems is online template placement. In this paper, we describe how existing algorithms work, and propose a new multi-stage method for mapping of tasks to reconfigurable hardware. Also a new ...
متن کامل